A Constraint - Posting Frameworkfor Scheduling Under
نویسندگان
چکیده
Scheduling in many practical industrial domains is complicated by the need to account for diverse and idiosyncratic constraints. Quite often these requirements are at odds with the techniques and results produced by the scheduling research community, which has focused in large part on solutions to more idealized, canonical problems. Recent research in temporal reasoning and constraint satisfaction has produced problem solving models that operate with respect to much more general representational assumptions. These frameworks ooer possibilities for developing scheduling technologies that naturally extend to accommodate the peculiarities of various application domains. One critical issue, of course, is whether such generality can be obtained without sacriicing scheduling performance. In this paper, we investigate this issue through application of a previously developed constraint satisfaction problem solving (CSP) model for deadline scheduling to a complicated, multi-product hoist scheduling problem encountered in printed circuit board (PCB) manufacturing. The goal is to maximize throughput of an automated PCB electroplating facility while ensuring feasibility with respect to process, capacity and material movement constraints. Building from a heuristic procedure generically referred to as PCP (precedence constraint posting), which relies on a temporal constraint graph representation of the problem, we straightforwardly deene an extended solution procedure for minimizing makespan. In a series of comparative experiments, our procedure is found to signiicantly outperform previously published procedures for solving this hoist problem across a broad range of input assumptions.
منابع مشابه
A Constraint - Posting Framework for Scheduling under Complex Constraints
Scheduling in many practical industrial domains is complicated by the need to account for diverse and idiosyncratic constraints. Quite often these requirements are at odds with the techniques and results produced by the scheduling research community, which has focused in large part on solutions to more idealized, canonical problems. Recent research in temporal reasoning and constraint satisfact...
متن کاملA precedence-constraint-posting procedure to generate schedules maximizing quality with anytime property
Inspired by the popularity of anytime algorithms in solving complex real world problems, we define a class of scheduling problems. In addition to the normal resource constrained project scheduling assumptions, each activity in a project has a quality profile with an anytime property, which means that it can be stopped at any time and the quality of the output is proportional to its duration. In...
متن کاملIncremental Constraint-Posting Algorithms in Interleaved Planning and Scheduling
In this paper we examine a collection of related incremental constraint-posting algorithms for temporal planning and for planning with continuous processes. The basis for these algorithms is an incremental version of the Bellman-Ford single-source shortest-path algorithm for consistency checking Simple Temporal Networks (STNs). We extend an existing incremental algorithm for STNs and then proce...
متن کاملPrecedence Constraint Posting for the RCPSP with Uncertain, Bounded Durations
The Resource Constrained Project Scheduling Problem is an important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and uncertain activity durations. We adopt a Precedence Constraint Posting approach and add precedence constraints to the original project graph so that all resource conflicts are solved and a consistent assignm...
متن کامل